%0 Book Section
%4 sid.inpe.br/plutao/2013/12.12.14.52.45
%2 sid.inpe.br/plutao/2013/12.12.14.52.46
%@doi 10.1007/978-3-319-02895-8_45
%@isbn 9783319028941
%F lattes: 5123287769635741 3 KörtingCastFons:2013:DiSeMe
%T The Divide and Segment Method for Parallel Image Segmentation
%D 2013
%A Korting, Thales Sehn,
%A Castejon, Emiliano Ferreira,
%A Fonseca, Leila Maria Garcia,
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@affiliation
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@electronicmailaddress thales@dpi.inpe.br
%@electronicmailaddress
%@electronicmailaddress leila@dpi.inpe.br
%E Blanc-Talon, J.,
%E Kasinski, A.,
%E Philips, W.,
%E Popescu, D.,
%E Sheunders, P.,
%B Advanced concepts for intelligen vision systems
%I Springer
%C Berlin
%P 504-515
%K parallel image segmentation, remote sensing, large spatial dimensions.
%X Remote sensing images with large spatial dimensions are usual. Besides, they also include a diversity of spectral channels, increasing the volume of information. To obtain valuable information from remote sensing data, computers need higher amounts of memory and more efficient processing techniques. The first process in image analysis is segmentation, which identifies regions in images. Therefore, segmentation algorithms must deal with large amounts of data. Even with current computational power, certain image sizes may exceed the memory limits, which ask for different solutions. An alternative to overcome such limits is to employ the well-known divide and conquer strategy, by splitting the image into chunks, and segmenting each one individually. However, it arises the problem of merging neighboring chunks and keeping the homogeneity in such regions. In this work, we propose an alternative to divide the image into chunks by defining noncrisp borders between them. The noncrisp borders are computed based on Dijkstra algorithm, which is employed to find the shortest path between detected edges in the images. By applying our method, we avoid the postprocessing of neighboring regions, and therefore speed up the final segmentation.
%@language pt
%3 korting2013divide.pdf
%U http://link.springer.com/10.1007/978-3-319-02895-8_45